Probability-Changing Cluster Algorithm: Study of Three-Dimensional Ising Model and Percolation Problem

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Bootstrapping the Three Dimensional Supersymmetric Ising Model.

We implement the conformal bootstrap program for three dimensional conformal field theories with N=2 supersymmetry and find universal constraints on the spectrum of operator dimensions in these theories. By studying the bounds on the dimension of the first scalar appearing in the operator product expansion of a chiral and an antichiral primary, we find a kink at the expected location of the cri...

متن کامل

Equilibrium Cluster Distributions of the Three-dimensional Ising Model in the One Phase Region*

We analyse equilibrium cluster distributions obtained numerically from a ferromagnetic king model (simple cubic lattice, 125000 sites and periodic boundary conditions) along the coexistence line and in the one-phase region below T,. We find evidences that the distribution of sizes and energies scales with temperature and external magnetic field giving Binder’s droplet exponent y z 4/9. The mean...

متن کامل

A Two-Dimensional Genetic Algorithm for the Ising Problem

The genetic algorithm is a powerful heuristic for the solution of hard combinatorial problems and has been investigated by numer ous authors. Many problems, arising for example in communi. cation networks, possess stro ng two-dimensional characteristics. We describe a genetic algorit hm with a new crossover operator called block-uniform crossover, which exploits the two-dimensional character of...

متن کامل

Replica-exchange algorithm and results for the three-dimensional random field ising model

The random field Ising model with Gaussian disorder is studied using a different Monte Carlo algorithm. The algorithm combines the advantages of the replica-exchange method and the two-replica cluster method and is much more efficient than the Metropolis algorithm for some disorder realizations. Three-dimensional systems of size 24(3) are studied. Each realization of disorder is simulated at a ...

متن کامل

0 Three - Dimensional Ising Model and Transfer Matrices

Using transfer matrix method to solve 3D Ising model is generalized straightforwardly from 2D case. We follow the B.Kaufman's approach. No approximation is made except the largest eigenvalue cannot be identified. This problem comes from the fact that we follow the choice of directions of 2-dimensional rotations in direct product space of 2D Ising model such that all eigenvalue equations reduce ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of the Physical Society of Japan

سال: 2002

ISSN: 0031-9015,1347-4073

DOI: 10.1143/jpsj.71.1570